Type-based analysis of logarithmic amortised complexity
نویسندگان
چکیده
We introduce a novel amortised resource analysis couched in type-and-effect system. Our is formulated terms of the physicist's method analysis, and potential-based. The type system makes use logarithmic potential functions first such to exhibit *logarithmic complexity*. With our approach we target automated self-adjusting data structures, like splay trees, which so far have only manually been analysed literature. In particular, implemented semi-automated prototype, successfully analyses zig-zig case *splaying*, once annotations are fixed.
منابع مشابه
Type-Based Amortised Heap-Space Analysis
We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on an amortised complexity analysis: the data is arbitrarily assigned a potential related to its size and layout; allocations must be ”payed for” from this potential. The potential of each input then furnishes an upper bound on the...
متن کاملEfficient Type-Checking for Amortised Heap-Space Analysis
The prediction of resource consumption in programs has gained interest in the last years. It is important for a number of areas, notably embedded systems and safety critical systems. Different approaches to achieve bounded resource consumption have been analysed. One of them, based on an amortised complexity analysis, has been studied by Hofmann and Jost in 2006 for a Java-like language. In thi...
متن کاملAutomated amortised analysis
Interpretation. The basic idea of abstract interpretation is to simplify and omit all calculations that do not directly influence the execution costs. For example, instead of computing a numeric value, it is only computed whether it is positive or negative, thereby speeding up the execution of the program to be examined. While having the attraction of being very general, one major disadvantage
متن کاملAutomatic Type Inference for Amortised Heap-Space Analysis
We present a fully automatic, sound and modular heap-space analysis for object-oriented programs. In particular, we provide type inference for the system of refinement types RAJA, which checks upper bounds of heap-space usage based on amortised analysis. Until now, the refined RAJA types had to be manually specified. Our type inference increases the usability of the system, as no user-defined a...
متن کاملAutomatic Amortised Worst-Case Execution Time Analysis
Our research focuses on formally bounded WCET analysis, where we aim to provide absolute guarantees on execution time bounds. In this paper, we describe how amortisation can be used to improve the quality of the results that are obtained from a fully-automatic and formally guaranteed WCET analysis, by delivering analysis results that are parameterised on specific input patterns and which take a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2021
ISSN: ['1469-8072', '0960-1295']
DOI: https://doi.org/10.1017/s0960129521000232